Sequential computability of a function - diagonal space and limiting recursion - Yoshiki Tsujii
نویسندگان
چکیده
We consider the real sequences in I = [0, 1) and real functions on I. A computability notion with respect to the uniformity {Un}, where Un(x) = [ k 2n , k+1 2n ) if x ∈ [ k 2n , k+1 2n ), will be called D-computability. An R-computable sequence from I will be shown to be approximated by a recursive sequence of rational numbers with a limiting recursive modulus of convergence with respect to {Un}. Using this result, we relate two extended notions of sequential computability of a function or a function sequence, one formulated in terms of limiting recursion and one in terms of {Un}.
منابع مشابه
Sequential Computability of a Function: Diagonal Space and Limiting Recursion
We consider the real sequences in I = [0, 1) and real functions on I . A computability notion with respect to the uniformity {Un}, where Un(x) = [ k 2n , k+1 2n ) if x ∈ [ k 2n , k+1 2n ), will be called Dcomputability. An R-computable sequence from I will be shown to be approximated by a recursive sequence of rational numbers with a limiting recursive modulus of convergence with respect to {Un...
متن کاملSequential Computability of a Function. Effective Fine Space and Limiting Recursion
We consider real sequences in I = [0, 1) and real functions on I . It is first shown that, as for real sequences from I , R-computability (computability with respect to the Euclidean topology) implies “weak Fine-computability.” Using this result, we show that “Fine-sequential computability” and “L∗-sequential computability” are equivalent for effectively locally Fine-continuous functions as wel...
متن کاملective uniformity versus limiting recursion in sequential computability of a function
The major objective of this article is a re nement of treatments of the mutual relationship between two notions of sequential computability of a function which is possibly Euclidean discontinuous one using limiting recursion and one using e ective uniformity We also speculate on these methods from a mathematician s viewpoint
متن کاملSequential Computability of a Function -limiting Recursion versus Effective Uniformity- to the Memory of Marian Boykan Pour-el
The major objective of this article is a refinement of treatments of the mutual relationship between two notions of “sequential computability” of a function which is possibly Euclidean-discontinuous, one using limiting recursion and one using effective uniformity. We also speculate on these methods from a mathematician’s viewpoint.
متن کاملComputability of Probability Distributions and Distribution Functions
We define the computability of probability distributions on the real line as well as that of distribution functions. Mutual relationships between the computability notion of a probability distribution and that of the corresponding distribution function are discussed. It is carried out through attempts to effectivize some classical fundamental theorems concerning probability distributions. We th...
متن کامل